Coloring and Guarding Arrangements
نویسندگان
چکیده
Given an arrangement of lines in the plane, what is the minimum number c of colors required to color the lines so that no cell of the arrangement is monochromatic? In this paper we give bounds on the number c, as well as some of its variations. We cast these problems as characterizing the chromatic and the independence numbers of a new family of geometric hypergraphs.
منابع مشابه
Special Guards in Chromatic Art Gallery
We present two new versions of the chromatic art gallery problem that can improve upper bound of the required colors pretty well. In our version, we employ restricted angle guards so that these modern guards can visit α-degree of their surroundings. If α is between 0 and 180 degree, we demonstrate that the strong chromatic guarding number is constant. Then we use orthogonal 90-degree guards for...
متن کاملColoring Complexes and Arrangements
Steingrimsson’s coloring complex and Jonsson’s unipolar complex are interpreted in terms of hyperplane arrangements. This viewpoint leads to short proofs that all coloring complexes and a large class of unipolar complexes have convex ear decompositions. These convex ear decompositions impose strong new restrictions on the chromatic polynomials of all finite graphs.
متن کاملA Graph-Coloring Result and Its Consequences For Polygon-Guarding Problems
We prove the following graph coloring result Let G be a connected bipartite planar graph Then one can triangulate G in such a way that the resulting graph is colorable This result implies several new upper bounds for guarding problems including the rst non trivial upper bound for the rectilinear Prison Yard Problem n vertex guards are su cient to watch the interior of a rectilinear polygon with...
متن کاملVisibility-based Distributed Deployment of Robotic Teams in Polyhedral Terrains
This paper presents deployment strategies for a team of multiple mobile robots with line-of-sight visibility in 1.5D and 2.5D terrain environments. Our objective is to distributively achieve full visibility of a polyhedral environment. In the 1.5D polyhedral terrain, we achieve this by determining a set of locations that the robots can distributively occupy. In the 2.5D polyhedral terrain, we a...
متن کاملAlmost Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Galleries
We address recently proposed chromatic versions of the classic Art Gallery Problem. Assume a simple polygon P is guarded by a finite set of point guards and each guard is assigned one of t colors. Such a chromatic guarding is said to be conflict-free if each point p ∈ P sees at least one guard with a unique color among all guards visible from p. The goal is to establish bounds on the function χ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 15 شماره
صفحات -
تاریخ انتشار 2013